Linear selections for the metric projection
نویسندگان
چکیده
منابع مشابه
Projection Inequalities and Their Linear Preservers
This paper introduces an inequality on vectors in $mathbb{R}^n$ which compares vectors in $mathbb{R}^n$ based on the $p$-norm of their projections on $mathbb{R}^k$ ($kleq n$). For $p>0$, we say $x$ is $d$-projectionally less than or equal to $y$ with respect to $p$-norm if $sum_{i=1}^kvert x_ivert^p$ is less than or equal to $ sum_{i=1}^kvert y_ivert^p$, for every $dleq kleq n$. For...
متن کاملMetric projection for dynamic multiplex networks
Evolving multiplex networks are a powerful model for representing the dynamics along time of different phenomena, such as social networks, power grids, biological pathways. However, exploring the structure of the multiplex network time series is still an open problem. Here we propose a two-step strategy to tackle this problem based on the concept of distance (metric) between networks. Given a m...
متن کاملOn Stability of the Metric Projection Operator
Abstract. Let M be a closed linear subspace of a normed linear space X. For a given f ∈ X denote by PM f the set of best approximations to f from M . The operator PM is termed the metric projection onto M . In this paper we are interested in the stability of the metric projection PM relative to perturbations of the subspace M . We mainly consider the case where X = Lp, p ∈ [1,∞]. We consider a ...
متن کاملContinuous Selections and Approximations in Α-convex Metric Spaces
In the paper, the notion of a generalized convexity was defined and studied from the view-point of the selection and approximation theory of set-valued maps. We study the simultaneous existence of continuous relative selections and graph-approximations of lower semicontinuous and upper semicontinuous set-valued maps with α-convex values having nonempty intersection.
متن کاملProjection Methods for Linear Systems
The aim of this paper is to give a uniied framework for deriving projection methods for solving systems of linear equations. We shall show that all these methods follow from a unique minimization problem. The particular cases of the methods of steepest descent, Richardson and conjugate gradients will be treated in details. Projection acceleration procedures for accelerating the convergence of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 1982
ISSN: 0022-1236
DOI: 10.1016/0022-1236(82)90070-2